Isoperimetric Functions of Finitely Generated Nilpotent Groups
نویسنده
چکیده
We show that the isoperimetric function of a nitely generated nilpotent group of class c is bounded above by a polynomial of degree 2c.
منابع مشابه
Isoperimetric Functions of Amalgams of Finitely Generated Nilpotent Groups along a Cyclic Subgroup
We show that amalgams of nitely generated torsionfree nilpotent groups of class c along a cyclic subgroup satisfy a polynomial isoperimetric inequality of degree 4c. The distortion of the amalgamated subgroup is bounded above by a polynomial of degree c. We also give an example of a non-cyclic amalgam of nitely generated torsionfree nilpotent groups along an abelian, isolated and normal subgrou...
متن کاملIsoperimetric inequalities for nilpotent groups
We prove that every finitely generated nilpotent group of class c admits a polynomial isoperimetric function of degree c+1 and a linear upper bound on its filling length function. 1991 Mathematics Subject Classification: 20F05, 20F32, 57M07
متن کاملHigher connectedness of asymptotic cones
We give coarse geometric conditions for a metric space X to have N -connected asymptotic cones. These conditions are expressed in terms of certain filling functions concerning filling N -spheres in an appropriate coarse sense. We interpret the criteria in the case where X is a finitely generated group Γ with a word metric. This leads to upper bounds on filling functions for groups with simply c...
متن کاملIsoperimetric Functions of Amalgamations of Nilpotent Groups
We consider amalgamations of nitely generated nilpotent groups of class c. We show that doubles satisfy a polynomial isoperimetric inequality of degree 2c. Generalising doubles we introduce non-twisted amalgamations and show that they satisfy a polynomial isoperimetric inequality as well. We give a su cient condition for amalgamations along abelian subgroups to be non-twisted and thereby to sat...
متن کاملIsoperimetric inequalities and the homology of groups
An isoperimetric function for a finitely presented group G bounds the number of defining relations needed to prove that a word w =G 1 in terms of the length of w. Suppose G = F/R is a finitely presented group where F is a finitely generated free group and R is the normal closure of a finite set of relators. For each w ∈ R we define the area ∆(w) to be the least number of uses of the given relat...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 1998